Structural Operational Semantics and Modal Logic, Revisited
نویسندگان
چکیده
منابع مشابه
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects. Firstly, a more abstract, conceptual proof of the main compositionality theorem is given, based on an understanding of modal logic as a study of coalgebras in slice categories of adjunctions. Secondly, a more concrete under...
متن کاملBialgebraic methods and modal logic in structural operational semantics
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational semantics (SOS). An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this paper, bialgebraic semantics is c...
متن کاملThe Semantics of Modal Predicate Logic II. Modal Individuals Revisited
We continue the investigations begun in [10]. We shall define a semantics that is build on a new notion of frame, called coherence frames. In these frames, objects are transcendental (world–independent), as in the standard constant–domain semantics. This will remove the asymmetry between constants and variables of the counterpart semantics of [10]. We demonstrate the completeness of (general) c...
متن کاملModal logic programming revisited
We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of MProlog without existential modal operators, as well as iterative deepening search and tabulation. Our SLD-resolution calculi for MProlog in a number of modal logics are still strongly complete ...
متن کاملFlow Logic and Operational Semantics
Flow logic is a \fast prototyping" approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the ow logic as well as in the operational semantics may inhibit proving the analysis correct. Our main conclusion is that environment based semantics is more exible than either substit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.07.019